Biased LexRank: Passage retrieval using random walks with question-based priors

نویسندگان

  • Jahna Otterbacher
  • Günes Erkan
  • Dragomir R. Radev
چکیده

We present Biased LexRank, a method for semi-supervised passage retrieval in the context of question answering. We represent a text as a graph of passages linked based on their pairwise lexical similarity. We use traditional passage retrieval techniques to identify passages that are likely to be relevant to a user’s natural language question. We then perform a random walk on the lexical similarity graph in order to recursively retrieve additional passages that are similar to other relevant passages. We present results on several benchmarks that show the applicability of our work to question answering and topic-focused text summarization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LexNet: A Graphical Environment for Graph-Based NLP

This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarization), biased LexRank (for passage retrieval), and TUMBL (for binary classification). All tools in the collection are based on random walks on lexical graphs, that is graphs where different NLP objects (e.g., sentences or...

متن کامل

CLAIRLIB Documentation v1.03

The Clair library is intended to simplify a number of generic tasks in Natural Language Processing (NLP), Information Retrieval (IR), and Network Analysis. Its architecture also allows for external software to be plugged in with very little effort. Functionality native to Clairlib includes Tokenization, Summarization, LexRank, Biased LexRank, Document Clustering, Document Indexing, PageRank, Bi...

متن کامل

Using Biased Random Walks for Focused Summarization

We introduce a graph-based sentence ranking algorithm for extractive summarization. Our method is a version of the LexRank algorithm we introduced in DUC 2004 extended to the focused summarization task of DUC 2006. As in LexRank, we represent the set of sentences in a document cluster as a graph, where nodes are sentences and links between the nodes are induced by a similarity relation between ...

متن کامل

First Passage Time Problem for Biased Continuous-time Random Walks

We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias is constant. When the bias depends linearly on the position, the full FPT density function is derived in terms of Hermite polynomials and generalized Mittag-...

متن کامل

Boosting Passage Retrieval through Reuse in Question Answering

Question Answering (QA) is an emerging important field in Information Retrieval. In a QA system the archive of previous questions asked from the system makes a collection full of useful factual nuggets. This paper makes an initial attempt to investigate the reuse of facts contained in the archive of previous questions to help and gain performance in answering future related factoid questions. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Manage.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2009